/*
 * @lc app=leetcode id=100 lang=java
 *
 * [100] Same Tree
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        //判断结构相同
        if(p!=null&&q==null||p==null&&q!=null)
            return false;
        //判断val相同
        if (q == null && p == null)
            return true;
        if(p.val!=q.val)
            return false;
        //判断左右子树是否相同
        return isSameTree(p.left, q.left)
           &&  isSameTree(p.right, q.right);
    }
}
// @lc code=end

